A Fault-Tolerant and Deadlock-Free Routing Protocol in 2D Meshes Based on Odd-Even Turn Model
نویسنده
چکیده
We propose a deterministic fault-tolerant and deadlock-free routing protocol in 2-dimensional (2-D) meshes based on dimension-order routing and the odd-even turn model. The proposed protocol, called extended X-Y routing, does not use any virtual channels by prohibiting certain locations of faults and destinations. Faults are contained in a set of disjointed rectangular regions called faulty blocks. The number of faults to be tolerated is unbounded as long as nodes outside faulty blocks are connected in the 2-D mesh network. The extended X-Y routing can also be used under a special convex fault region called an orthogonal faulty block, which can be derived from a given faulty block by activating some nonfaulty nodes in the block. Extensions to partially adaptive routing, trafficand adaptivity-balanced using virtual networks, and routing without constraints using virtual channels and virtual networks are also discussed.
منابع مشابه
Fault-Tolerant and Deadlock-Free Routing in 2-D Meshes Using Rectilinear-Monotone Polygonal Fault Blocks
We propose a deterministic fault-tolerant and deadlock-free routing protocol in 2-dimensional (2-D) meshes based on Wu’s fault-tolerant odd–even turn model and Wang’s rectilinear-monotone polygonal fault block model. The fault-tolerant odd–even turn protocol, also called extended X–Y routing, was originally proposed to achieve fault-tolerant and deadlock-free routing among traditional, rectangu...
متن کاملCAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کاملAdaptive Fault-tolerant Wormhole Routing in 2D Meshes
We present an adaptive fault-tolerant wormhole routing algorithm for 2D meshes. The main feature is that with the algorithm, a normal routing message, when blocked by some faulty processor, would detour along the f-polygons around the fault region. The proposed algorithm can tolerate convex faults with only three virtual channels per physical channel regardless of the overlapping of fpolygons o...
متن کاملKIM and HAN : FAULT - TOLERANT ADAPTIVE WORMHOLE ROUTING IN 2 D MESH
A fault-tolerant wormhole routing algorithm on meshconnected processors is proposed. The proposed algorithm is based on the solid fault model and allows the fault polygons to be overlapped. The algorithm compares the position of fault region relative to current channel with the fault direction eld of a misrouted message to route around overlapped fault polygons. A node deactivating algorithm to...
متن کاملAnalyzing Software Component Graphs of Grid Middleware: Hint to Performance Improvement
An ACO Inspired Strategy to Improve Jobs Scheduling in a Grid Environment p. 30 Architecture Aware Partitioning Algorithms p. 42 A Simple and Efficient Fault-Tolerant Adaptive Routing Algorithm for Meshes p. 54 Deadlock-Free Adaptive Routing in 2D Tori with a New Turn Model p. 58 Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph p. 70 Fault Tolerance in the Biswapped Network ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 52 شماره
صفحات -
تاریخ انتشار 2003